End-to-End Delay Analysis for Wireless Control Networks under EDF Scheduling
نویسندگان
چکیده
OF THE THESIS End-to-End Delay Analysis for Wireless Control Networks under EDF Scheduling by Chengjie Wu Master of Science in Computer Science Washington University in St. Louis, August 2013 Research Advisor: Professor Chenyang Lu Process industries are starting to adopt multi-hop and multi-channel wireless control networks (WCNs) for process control applications. To meet the stringent real-time performance requirements of control systems, there is a critical need for fast end-to-end delay analysis to support online admission control of periodic real-time flows. While recent results on delay analysis for WCNs have focused on fixed-priority scheduling, this thesis presents the first end-to-end delay analysis for real-time flows in WCNs that schedule transmissions based on the Earliest Deadline First (EDF) policy, a widely used dynamic scheduling policy in real-time systems. This analysis provides safe end-to-end delay bounds for real-time flows and can be used for efficient admission control at run time. Simulations based on both random topologies and the topology of a wireless testbed demonstrate the effectiveness of our analysis for online admission control of real-time flows.
منابع مشابه
Resource Division Policies for EDF Scheduling in ATM Networks
The paper addresses the issue of reserving resources at ATM switches along the path of calls requiring a deterministic bound on end-to-end delay. The switches are assumed to schedule outgoing cells using the EarliestDeadline -First (EDF) scheduling discipline. EDF is known to be an optimal scheduling discipline when providing delay bounds to a number of calls being served by a single scheduler....
متن کاملDelay - Concerned Opportunistic Scheduling Algorithm in Wireless Communication Networks
In this paper we examine the packets’ delay performance under the temporal fairness opportunistic scheduling (TFOS) algorithm which is first introduced in [1]. We also simulate the earliest deadline-first (EDF) scheduling algorithm in the wireless environment. We find that the opportunistic scheduling algorithm biases the users who always experience the good channel condition in packets’ delay ...
متن کاملEnd-to-End Statistical Delay Service under GPS and EDF Scheduling: A Comparison Study
Generalized Processor Sharing (GPS) has gained much popularity in recent years as a simple and effective scheduling mechanism for the provisioning of Quality of Service (QoS) in emerging high-speed networks. For supporting deterministic end-to-end delay guarantees, GPS is known to be sub-optimal in comparison to the Earliest Deadline First (EDF) scheduling discipline; nevertheless it is often p...
متن کاملEnd-to-End Statistical Delay Guarantees using Earliest Deadline First (EDF) Packet Scheduling
This paper develops a framework for statistically guaranteeing end-to-end delay bounds to envelopeconstrained connections transporting real-time traffic in a network of switches employing the Earliest Deadline First (EDF) packet scheduling scheme in conjunction with per-hop traffic shaping. The performance of an isolated EDF scheduler fed by markovian sources has been studied earlier in the lit...
متن کاملDynamic Joint Scheduling and Congestion Control in Wireless Networks
The network nodes that are connected by wireless data connections called as wireless networks. The devices are connected via wireless link to communicate with each other. In wireless networks, it is very difficult to maintain the trade-off between throughput and delay. This paper proposes a new joint scheduling and congestion control algorithm for multihop wireless networks with dynamic route f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015